On Canonical Forms

On Canonical Binary Trilinear Forms

On Equivalence and Canonical Forms

Decidability of de nitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of de nitional equality are based on a con uent, strongly-normalizing notion of reduction. Coquand has considered a di erent approach, directly proving the correctness of a practical equivalance algorithm based on the shape o...

On canonical forms of ring-linear codes

This work presents an algorithm for the computation of canonical forms of linear codes over arbitrary finite chain rings under the action of the linear isometry group. It is a generalization of a previous work by the author on the canonization of linear codes over finite fields. The algorithm is based on the ideas of partition refinements and it will compute the automorphism group of the code a...

On Apolarity and Generic Canonical Forms

The theory of apolarity was first developed by Clebsch, Lasker, Richw x mond, Sylvester, and Wakeford 10, 17, 20 . They were first interested in studying homogeneous polynomials of degree p and in q variables, and in expressing them as sums of pth powers of linear terms. The problem is to minimize the number of pth powers which are required in such a sum. For instance, a result due to Sylvester...

On Canonical Forms for Frequent Graph Mining

In approaches to frequent graph mining that are based on growing subgraphs into a set of graphs, one of the core problems is how to avoid redundant search. A powerful technique to overcome this problem is a canonical description of a graph, which uniquely identifies it, and a corresponding test. This paper introduces a family of canonical forms that are based on systematic ways to construct spa...